Solving maximum clique problem by cellular neural network
نویسندگان
چکیده
منابع مشابه
An Improved Chaotic Maximum Neural Network for Maximum Clique Problem
We propose an improved chaotic maximum neural network to solve maximum clique problem. Through analyzing the character of maximum neural network with an added vertex in maximum clique problem, we find that the quality and size of clique solution can be modified by tuning a parameter about vertex weight. Based on the analysis, a random nonlinear self-feedback and flexible annealing strategy are ...
متن کاملApproximately solving Maximum Clique using neural network and related heuristics
We explore neural network and related heuristic methods for the fast approximate solution of the Maximum Clique problem. One of these algorithms, Mean Field Annealing, is implemented on the Connection Machine CM-5 and a fast annealing schedule is experimentally evaluated on random graphs, as well as on several benchmark graphs. The other algorithms, which perform certain randomized local search...
متن کاملSolving the Maximum Clique Problem Using PUBB
Given an (undirected) graph G = (V;E); a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a classical NP–hard problem, and many algorithms, both heuristic and exact, have been proposed. While the philosophy behind the heuristic algorithms varies greatly, almost all of the exact algorithms are designed in the bran...
متن کاملOn solving the maximum clique problem
Abstract. The Maximum Clique Problem (MCP) is regarded here as the maximization of an indefinite quadratic form over the canonical simplex. For solving MCP an algorithm based upon Global Optimality Conditions (GOC) is applied. Furthermore, each step of the algorithm is analytically investigated and tested. The computational results for the proposed algorithm are compared with other Global Searc...
متن کاملModified Approach for Solving Maximum Clique Problem
1.1 Maximum Clique Problem Assume that the finite undirected simple graph is given, where V is the set of nodes, E is the set of edges. The arbitrary full graph is called a clique. The clique, which does not contain other cliques, is called a maximal Clique. The largest maximal clique is called a maximum clique. To extract all maximal cliques from the graph G. Many algorithms have...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics Letters
سال: 1998
ISSN: 0013-5194
DOI: 10.1049/el:19981026